#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL exgcd(LL &x,LL &y,LL a,LL b)
{
    if(!b)
    {
        x=1;
        y=0;
        return a;
    }
    LL ret=exgcd(y,x,b,a%b);
    y-=a/b*x;
    return ret;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL a,b,p;cin>>a>>b>>p;
    LL k1=p-a,k2=p-b,x,y;
    if(!a&&!b) cout<<0<<" "<<0<<" "<<0<<"\n";
    else{
        exgcd(x,y,p,k2);
        x=(x%k2+k2)%k2;
        if(!x) x+=k2;
        x*=(1+a);
        k1=x*p-a;
        cout<<(p-1)<<" "<<k1*(p-1)<<" "<<k2*(p-1)<<"\n";
    }
  }
return 0;
}
